Hyperspace selections avoiding points

We deal with a hyperspace selection problem in the setting of connected spaces. present two solutions this illustrating difference between selections for nonempty closed sets, and those at most two-point sets. In first case, we obtain characterisation compact orderable latter case --- that same property is equivalent to existence ternary relation on space, known as cyclic order, gives so called weakly cyclically